Browsing by Subject "Communication graphs"

Now showing items 1-2 of 2

    • Article  

      Efficient gossip and robust distributed computation 

      Georgiou, Chryssis; Kowalski, D. R.; Shvartsman, A. A. (2003)
      This paper presents an efficient deterministic gossip algorithm for p synchronous, crash-prone, message-passing processors. The algorithm has time complexity T = O(log2 p) and message complexity M = O(p1+ε), for any ε > ...
    • Conference Object  

      On the structure and evolution of vehicular networks 

      Pallis, George C.; Katsaros, Dimitrios S.; Dikaiakos, Marios D.; Loulloudes, Nicholas; Tassiulas, L. (2009)
      Vehicular ad hoc networks have emerged recently as a platform to support intelligent inter-vehicle communication and improve traffic safety and performance. The road-constrained and high mobility of the vehicles, their ...